STRUCTURE OF A COMPUTER PROGRAM FOR DETERMINING THE OPTIMAL PATH DIRECTED GRAPH USING DIJKSTRA’S ALGORITHM

Ensuring the minimum tension during thread processing on technological equipment allows to reduce downtime due elimination or significant reduction of breaks. Minimization is ensured by optimization shape filling line, in which total angle coverage guides will be minimal. This problem solved using Dijkstra’s algorithm finding optimal path a directed graph. The computer program for implementing this you optimize form equipment. development application packages programs time design processes light and textile industry as much possible. modernization line equipment, minimize working area. Construction graph allow obtain Constructive structural elements guides, tensioning devices, break control have cylindrical, elliptical shape, discrete segments straight act obstacles thread. Straight can an inclination relative vertical axis. Taking into account large number feeding system machines their location, there need develop special determining Dijkstra when searching objective function necessary tension, sum angles covered guide surfaces that line. use determine tensions changes zones machines, supply even at stage designing process. algorithms undirected graph, influence target function. Determining effect angles, determination oriented important component area industry, formation knitted products.